A simple exact separation algorithm for 2-matching inequalities
نویسندگان
چکیده
In this work we present an exact separation algorithm for the so called 2-matching inequalities, otherwise known as parity or co-circuit inequalities. The algorithm is quite simple since it operates on the tree of min-cuts of the support graph of the solution to separate, relative to an ad hoc capacity vector. The order of this algorithm is O(|V |).
منابع مشابه
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the teeth. We say that a comb inequality is simple if the following holds for each tooth: either the intersection of the tooth with the handle has cardinality one, or the part of the tooth outside the handle has cardinality...
متن کاملSeparating a Superclass of Comb Inequalities in Planar Graphs
Many classes of valid and facet-inducing inequalities are known for the family of polytopes associated with the Symmetric Travelling Salesman Problem (STSP), including subtour elimination, 2-matching and comb inequalities. For a given class of inequalities, an exact separation algorithm is a procedure which, given an LP relaxation vector x∗, 7nds one or more inequalities in the class which are ...
متن کاملPolynomial-Time Separation of Simple Comb Inequalities
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the teeth. We say that a comb inequality is simple if the following holds for each tooth: either the intersection of the tooth with the handle has cardinality one, or the part of the tooth outside the handle has cardinality...
متن کاملA Faster Exact Separation Algorithm for Blossom Inequalities
In 1982, Padberg and Rao gave a polynomial-time separation algorithm for b-matching polyhedra. The current best known implementations of their separation algorithm run inO(|V ||E| log(|V |/|E|)) time when there are no edge capacities, but in O(|V ||E| log(|V |/|E|)) time when capacities are present. We propose a new exact separation algorithm for the capacitated case which has the same running ...
متن کاملComputational testing of exact mixed knapsack separation for MIP problems
In this paper we study an exact separation algorithm for mixed knapsack sets with the aim of evaluating its effectiveness in a cutting plane algorithm for Mixed-Integer Programming. First proposed by Boyd in the 90’s, exact knapsack separation has recently found renewed interest. In this paper we present a “lightweight” exact separation procedure for mixed knapsack sets and perform a computatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008